Coherent random permutations with record statistics
نویسنده
چکیده
157 HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm A two-parameter family of random permutations of [n] is introduced, with distribution conditionally uniform given the counts of upper and lower records. The family interpolates between two versions of Ewens' distribution. A distinguished role of the family is determined by the fact that every sequence of coherent permutations (πn, n = 1, 2,. . .) with the indicated kind of sufficiency is obtainable by randomisation of the parameters. Generating algorithms and asymptotic properties of the permutations follow from the representation via initial ranks.
منابع مشابه
Asymptotic behavior of some statistics in Ewens random permutations
The purpose of this article is to present a general method to find limiting laws for some renormalized statistics on random permutations. The model considered here is Ewens sampling model, which generalizes uniform random permutations. We describe the asymptotic behavior of a large family of statistics, including the number of occurrences of any given dashed pattern. Our approach is based on th...
متن کاملRandom Permutations and Bernoulli Sequences
— The so-called first fundamental transformation provides a natural combinatorial link between statistics involving cycle lengths of random permutations and statistics dealing with runs on Bernoulli sequences.
متن کاملCoherent Permutations with Descent Statistic andthe Boundary Problem for the Graph ofZigzag Diagrams
The graph of zigzag diagrams is a close relative of Young’s lattice. The boundary problem for this graph amounts to describing coherent random permutations with descent–set statistic, and is also related to certain positive characters on the algebra of quasisymmetric functions. We establish connections to some further relatives of Young’s lattice and solve the boundary problem by reducing it to...
متن کاملThe Distribution of the Size of the Union of Cycles for Two Types of Random Permutations
We discuss some problems and permutation statistics involving two different types of random permutations. Under the usual model of random permutations, we prove that the shifted coverage of the elements of {1, 2, . . . , k} of a random permutation over {1, 2, . . . , n}; that is, the size of the union of the cycles containing these elements, excluding these elements themselves, follows a negati...
متن کاملThe Shape of Random Pattern-avoiding Permutations
We initiate the study of limit shapes for random permutations avoiding a given pattern. Specifically, for patterns of length 3, we obtain delicate results on the asymptotics of distributions of positions of numbers in the permutations. We view the permutations as 0-1 matrices to describe the resulting asymptotics geometrically. We then apply our results to obtain a number of results on distribu...
متن کامل